#include <bits/stdc++.h>
using namespace std;
const int MAX_ARRAY = 1000000;
// #define MULTIPLE 1
void solve() {
int n, m;
std::string str;
cin >> n;
cin >> str;
int ans = 0;
for (int i = 0; i < n && str[i] == '<'; i++) {
++ans;
}
for (int i = n - 1; i >= 0 && str[i] == '>'; i--) {
++ans;
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
cout.tie(nullptr);
int tests{1};
#ifdef MULTIPLE
cin >> tests;
#endif
while (tests--) {
solve();
}
return 0;
}
1714E - Add Modulo 10 | 1714A - Everyone Loves to Sleep |
764A - Taymyr is calling you | 1714B - Remove Prefix |
1264F - Beautiful Fibonacci Problem | 52A - 123-sequence |
1543A - Exciting Bets | 1714D - Color with Occurrences |
215B - Olympic Medal | 1445A - Array Rearrangment |
1351A - A+B (Trial Problem) | 935B - Fafa and the Gates |
1291A - Even But Not Even | 1269A - Equation |
441A - Valera and Antique Items | 1702C - Train and Queries |
816B - Karen and Coffee | 838D - Airplane Arrangements |
148B - Escape | 847G - University Classes |
1110A - Parity | 1215B - The Number of Products |
604C - Alternative Thinking | 1204C - Anna Svyatoslav and Maps |
322A - Ciel and Dancing | 1689B - Mystic Permutation |
1711B - Party | 1702D - Not a Cheap String |
1714F - Build a Tree and That Is It | 1703F - Yet Another Problem About Pairs Satisfying an Inequality |